Pii: S0925-7721(99)00018-8
نویسندگان
چکیده
This paper considers representations of graphs as rectangle-visibility graphs and as doubly linear graphs. These are, respectively, graphs whose vertices are isothetic rectangles in the plane with adjacency determined by horizontal and vertical visibility, and graphs that can be drawn as the union of two straight-edged planar graphs. We prove that these graphs have, with n vertices, at most 6n− 20 (respectively, 6n− 18) edges, and we provide examples of these graphs with 6n− 20 edges for each n> 8. 1999 Elsevier Science B.V. All rights reserved.
منابع مشابه
A note on parallel algorithms for optimal h-v drawings of binary trees
In this paper we present a method to obtain optimal h-v drawings in parallel. Based on parallel tree contraction, our method computes optimal (with respect to a class of cost functions of the enclosing rectangle) drawings in O(log n) parallel time by using a polynomial number of EREW processors. The number of processors reduces substantially when we study minimum area drawings. Our work places ...
متن کاملNatural neighbor coordinates of points on a surface
Natural neighbour coordinates and natural neighbour interpolation have been introduced by Sibson for interpolating multivariate scattered data. In this paper, we consider the case where the data points belong to a smooth surface S, i.e. a (d ? 1)-manifold of R d. We show that the natural neighbour coordinates of a point X belonging to S tends to behave as a local system of coordinates on the su...
متن کاملSelf-customized BSP trees for collision detection
The ability to perform eecient collision detection is essential in virtual reality environments and their applications, such as walkthroughs. In this paper we re-explore a classical structure used for collision detection { the binary space partitioning tree. Unlike the common approach, which attributes equal likelihood to each possible query, we assume events that happened in the past are more ...
متن کاملDiscrete rectilinear 2-center problems
Given a set P of n points in the plane, we seek two squares such that their center points belong to P , their union contains P , and the area of the larger square is minimal. We present efficient algorithms for three variants of this problem: In the first the squares are axis parallel, in the second they are free to rotate but must remain parallel to each other, and in the third they are free t...
متن کاملPii: S0925-7721(99)00016-4
Define a graph GT (n) with one node for each triangulation of a convex n-gon. Place an edge between each pair of nodes that differ by a single flip: two triangles forming a quadrilateral are exchanged for the other pair of triangles forming the same quadrilateral. In this paper we introduce a tree of all triangulations of polygons with any number of vertices which gives a unified framework in w...
متن کامل